- nearest integer functions
- Вычислительная техника: функции ближайшего целого
Универсальный англо-русский словарь. Академик.ру. 2011.
nearest integer functions
Смотреть что такое "nearest integer functions" в других словарях:
Nearest integer function — In computer science, the nearest integer function of real number x denoted variously by [x][1], , ,[2] nint(x), or Round(x), is a function which returns the nearest integer to x. To avoid ambiguity when operating on half integers, a rounding rule … Wikipedia
C mathematical functions — C Standard Library Data types Character classification Strings Mathematics File input/output Date/time Localizati … Wikipedia
Floor and ceiling functions — In mathematics and computer science, the floor and ceiling functions map real numbers to nearby integers. [Ronald Graham, Donald Knuth and Oren Patashnik. Concrete Mathematics . Addison Wesley, 1999. Chapter 3, Integer Functions .] The floor… … Wikipedia
k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… … Wikipedia
K-nearest neighbor algorithm — In pattern recognition, the k nearest neighbor algorithm ( k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance based learning, or lazy learning where the function is only… … Wikipedia
функции ближайшего целого — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN nearest integer functions … Справочник технического переводчика
Rounding — This article is about numerical rounding. For lip rounding in phonetics, see Labialisation. For other uses, see Rounding (disambiguation). Rounding a numerical value means replacing it by another value that is approximately equal but has a… … Wikipedia
JavaScript syntax — This article is part of the JavaScript series. JavaScript JavaScript syntax JavaScript topics This box: view · … Wikipedia
Generalizations of Fibonacci numbers — In mathematics, the Fibonacci numbers form a sequence defined recursively by:: F (0) = 0: F (1) = 1: F ( n ) = F ( n 1) + F ( n 2), for integer n > 1.That is, after two starting values, each number is the sum of the two preceding numbers.The… … Wikipedia
JPEG — For other uses, see JPEG (disambiguation). Joint Photographic Experts Group A photo of a cat compressed with successively more lossy compression ratios from right to left Filename extension .jpg … Wikipedia
Double exponential function — A double exponential function (red curve) compared to a single exponential function (blue curve). A double exponential function is a constant raised to the power of an exponential function. The general formula is , which grows much more quickly… … Wikipedia
